I/O-efficient dynamic planar point location
نویسندگان
چکیده
منابع مشابه
Point Location in Dynamic Planar Subdivisions
We study the point location problem on dynamic planar subdivisions that allows insertions and deletions of edges. In our problem, the underlying graph of a subdivision is not necessarily connected. We present a data structure of linear size for such a dynamic planar subdivision that supports sublinear-time update and polylogarithmic-time query. Precisely, the amortized update time is O( √ n log...
متن کاملI/o-eecient Dynamic Planar Point Location
We present the rst provably I/O-e cient dynamic data structure for point location in a general planar subdivision. Our structure uses O(N=B) disk blocks to store a subdivision of size N , where B is the disk block size. Queries can be answered in O(log2 B N) I/Os in the worst-case, and insertions and deletions can be performed in O(log B N) and O(log B N) I/Os amortized, respectively. Previousl...
متن کاملNew Results on Dynamic Planar Point Location
A point location scheme is presented for an n-veriet dynamic planar subdivision whose underlying graph is only required to be connected. The scheme uses O(n) space, yields an O(log2 n) query time and an O(1ogn) update time. Insertion (resp. deleiion) of an arbitrary k-edge chain inside a region can be performed in O(klog(n+k)) (resp. O(k1ogn)) iime. The scheme is then ectended to speed up the i...
متن کاملAdaptive Planar Point Location
We present a self-adjusting point location structure for convex subdivisions. Let n be the number of vertices in a convex subdivision S. Our structure for S uses O(n) space and processes any online query sequence σ in O(n+ OPT) time, where OPT is the minimum time required by any linear decision tree for answering point location queries in S to process σ. The O(n + OPT) time bound includes the p...
متن کاملEfficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case query time, there has been surprisingly little theoretical work on expected-case query time. We are given an n-vertex planar polygonal subdivision S satisfying some weak assumptions (satisfied, for example, by all convex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2004
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2003.04.001